A Linear Time Algorithm for Deciding Interval Graph Isomorphism
نویسندگان
چکیده
منابع مشابه
A Polynomial Time Algorithm for Graph Isomorphism
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
متن کاملPolynomial Time Algorithm for Graph Isomorphism Testing
Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. http://dx.doi.org/10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which...
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملGraph Isomorphism for Bounded Genus Graphs In Linear Time
For every integer g, isomorphism of graphs of Euler genus at most g can be decided in linear time. This improves previously known algorithms whose time complexity is nO(g) (shown in early 1980’s), and in fact, this is the first fixed-parameter tractable algorithm for the graph isomorphism problem for bounded genus graphs in terms of the Euler genus g. Our result also generalizes the seminal res...
متن کاملA Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n))
It is known, that ordinary isomorphisms (associativity and commutativity of \times", isomorphisms for \times" unit and currying) provide a complete axiomatisation of isomorphism of types in multiplica-tive linear lambda calculus (isomorphism of objects in a free symmetric monoidal closed category). One of the reasons to consider linear isomor-phism of types instead of ordinary isomorphism was t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1979
ISSN: 0004-5411,1557-735X
DOI: 10.1145/322123.322125